By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 19, Issue 4, pp. 593-773

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Number of Shortest Paths on the Surface of a Polyhedron

David M. Mount

pp. 593-611

Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees

F. Chin and H. F. Ting

pp. 612-626

On the Analysis of Synchronous Computing Systems

J. M. Jover, T. Kailath, H. Lev-Ari, and S. K. Rao

pp. 627-643

Partial Types and Intervals

M. Dezani-Ciancaglini and B. Venneri

pp. 644-658

Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero $4$

Bill Jackson

pp. 659-665

Greedy Matching on the Line

Alan Frieze, Colin McDiarmid, and Bruce Reed

pp. 666-672

A Note on Bennett's Time-Space Tradeoff for Reversible Computation

Robert Y. Levine and Alan T. Sherman

pp. 673-677

Planar Depth-First Search in $O(\log n)$ Parallel Time

Torben Hagerup

pp. 678-704

A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size

WanSoo T. Rhee

pp. 705-710

Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$

D. R. Stinson

pp. 711-717

Toward Understanding Exclusive Read

Faith E. Fich and Avi Wigderson

pp. 718-727

Scheduling Sequential Loops on Parallel Processors

Ashfaq A. Munshi and Barbara Simons

pp. 728-741

On Finding and Verifying Locally Optimal Solutions

Mark W. Krentel

pp. 742-749

The Structure of Polynomial Ideals and Gröbner Bases

Thomas W. Dubé

pp. 750-773